ENFORCED HAMILTONIAN CYCLES IN DISTANCE GRAPHS

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enforced hamiltonian cycles in generalized dodecahedra

The H-force number of a hamiltonian graph G is the smallest number k with the property that there exists a set W ⊆ V (G) with |W | = k such that each cycle passing through all vertices of W is a hamiltonian cycle. In this paper, we determine the H-force numbers of generalized dodecahedra.

متن کامل

Long Cycles in Hamiltonian Graphs

We prove that if an n-vertex graph with minimum degree at least 3 contains a Hamiltonian cycle, then it contains another cycle of length n− o(n); in particular, this verifies, in an asymptotic form, a well-known conjecture due to Sheehan from 1975.

متن کامل

Small Cycles in Hamiltonian Graphs

We prove that if a graph G on n > 32 vertices is hamiltonian and has two nonadjacent vertices u and u with d(u) + d(u) 3 n + z where z = 0 if n is odd and z = 1 if n is even, then G contains all cycles of length m where 3 < m < 1/5(n + 13).

متن کامل

Hamiltonian Cycles in Sparse Graphs

Hamiltonian Cycles in Sparse Graphs Alexander Hertel Master of Science Graduate Department of Computer Science University of Toronto 2004 The subject of this thesis is the Hamiltonian Cycle problem, which is of interest in many areas including graph theory, algorithm design, and computational complexity. Named after the famous Irish mathematician Sir William Rowan Hamilton, a Hamiltonian Cycle ...

متن کامل

Disjoint Hamiltonian cycles in graphs

Let G be a 2(k + I)-connected graph of order n. It is proved that if uv rJ. E(G) implies that max{d(u), d(v)} ?: ~ + 2k then G contains k + 1 pairwise disjoint Hamiltonian cycles when c5 (G) ?: 4k + 3. 1 .. Introduction All graphs we consider are finite and simple. We use standard terminology and notation from Bondy and Murty [2] except as indicated. Let G = (V(G), E(G)) be a graph with vertex ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Pure and Apllied Mathematics

سال: 2015

ISSN: 1311-8080,1314-3395

DOI: 10.12732/ijpam.v105i4.17